Modal Scenarios as Automata

نویسندگان

  • David Harel
  • Amir Kantor
چکیده

Scenario-based modeling in live sequence charts (LSC) involves specifying multi-modal inter-object scenarios, in which events can be mandatory (hot) or possible (cold). In translating LSCs into automata over infinite words, an intermediate step constructs a kind of transition system that we call a modal state structure (MSS). Here we present MSSs as abstract forms of modal scenarios (with both mandatory, possible and forbidden behavior), which may encode more general patterns than those inherent in LSC, such as loops, alternatives and breaks. MSSs are essentially automata, in which the notion of temperature is adopted from LSCs, replacing traditional acceptance conditions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Sensors Location Using Modal Assurance Criterion in Modal Identification of Concrete Gravity Dams

Determination of the optimal sensors location in order to identify of modal parameters, especially in large structures such as dams, is one of the practical issues, which is widely used in damage detection and structural health monitoring. The main objective of this study is to obtain the most information from the dynamic response in a concrete gravity dam by minimizing the non-diagonal element...

متن کامل

Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata

We introduce a novel automata-theoretic approach for the verification of multi-agent systems. We present epistemic alternating tree automata, an extension of alternating tree automata, and use them to represent specifications in the temporal-epistemic logic CTLK. We show that model checking a memory-less interpreted system against a CTLK property can be reduced to checking the language non-empt...

متن کامل

Modal I/O Automata for Interface and Product Line Theories

Alfaro and Henzinger use alternating simulation in a two player game as a refinement for interface automata [1]. We show that interface automata correspond to a subset of modal transition systems of Larsen and Thomsen [2], on which alternating simulation coincides with modal refinement. As a consequence a more expressive interface theory may be built, by a simple generalization from interface a...

متن کامل

Simulation and Evaluation of Urban Development Scenarios Using Integration of Cellular Automata Model and Game Theory

Urban growth is a dynamic and evolutionary spatial and social process that relates to the changes of urban spatial units and the transformation of people’s lifestyles and consequently demographic changes. Considering the urban development process as a function of land uses interactions, population structure and the strategic behavior of the agents involved in the urban development process (the ...

متن کامل

Completeness for the modal μ-calculus: separating the combinatorics from the dynamics

The modal mu-calculus is a very expressive formalism extending basic modal logic with least and greatest fixpoint operators. In the seminal paper introducing the formalism in the shape known today, Dexter Kozen also proposed an elegant axiom system, and he proved a partial completeness result with respect to the Kripke-style semantics of the logic. The problem of proving Kozen’s axiom system co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014